A linear-time algorithm for radius-optimally augmenting paths in a metric space

Let P be a path graph of n vertices embedded in metric space. We consider the problem adding new edge to minimize radius resulting graph. Previously, similar for minimizing diameter was solved O(nlog?n) time. To best our knowledge, has not been studied before. In this paper, we present an O(n) time algorithm problem, which is optimal.